SDTR: Soft Decision Tree Regressor for Tabular Data
نویسندگان
چکیده
Deep neural networks have been proved a success in multiple fields. However, researchers still favor traditional approaches to obtain more interpretable models, such as Bayesian methods and decision trees when processing heterogeneous tabular data. Such models are hard differentiate, thus inconvenient be integrated into end-to-end settings. On the other hand, differentiable but perform poorly on We propose hierarchical regression model, Soft Decision Tree Regressor (SDTR). SDTR imitates binary tree by network is plausible for ensemble schemes like bagging boosting. The method was evaluated tabular-based tasks (YearPredictionMSD, MSLR-Web10K, Yahoo LETOR, SARCOS Wine quality). Its performance comparable with non-differentiable (gradient boosting trees) better than uninterpretable (regular FCNN). top of that, it can produce fair results restricted number parameters, only using small forest or even single tree. also an “average entropy” metric evaluate level interpretability trained, soft network. This helps select proper structure hyperparameters networks.
منابع مشابه
A Soft Decision Tree
Searching for binary partition of attribute domains is an important task in Data Mining, particularly in decision tree methods. The most important advantage of decision tree methods are based on compactness and clearness of presented knowledge and high accuracy of classification. In case of large data tables, the existing decision tree induction methods often show to be inefficient in both comp...
متن کاملA decision tree for soft tissue grafting.
Periodontal plastic surgery is commonly performed for esthetic and physiologic reasons, such as alleviating root sensitivity, root caries, and cervical abrasion and facilitating plaque control at the affected site. Currently, there is a lack of information regarding the most appropriate treatment method for the various clinical situations encountered. The aims of this paper are to review and di...
متن کاملTree - Decision Trees for Tree Structured Data∗
We present Tree, a new approach to structural classification. This integrated approach induces decision trees that test for pattern occurrence in the inner nodes. It combines state-of-the-art tree mining with sophisticated pruning techniques to find the most discriminative pattern in each node. In contrast to existing methods, Tree uses no heuristics and only a single, statistically well founde...
متن کاملA New Algorithm for Optimization of Fuzzy Decision Tree in Data Mining
Decision-tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic decision tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible decision trees have been designed for perfect symbolic data. Classical crisp decision trees (DT) are widely applied to classification t...
متن کاملIntelligent Tree Computing, Decision Trees and Soft OOP Tree Computing
Intelligent tree computing techniques are defined with applications to decision tree computing defining decisive agent computing. New linguistics abstraction theories are presented. Treating objects as abstract data types and a two level programming approach to OOP allows us to define Pullup abstractions to treat incompatible objects. A basis for a tree computing theory for abstract objects wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2021
ISSN: ['2169-3536']
DOI: https://doi.org/10.1109/access.2021.3070575